Represents a mutable array type that can be sliced to return new versions of the array which represent subsections of the original but without copying to a new buffer. This means the underlying array is shared and vulnerable to data race issues and the commonly known issues of mutable structures.

It is primarily to facilitate super-fast algorithms that work on collections. The idea being that the algorithm knows about the issues of mutation and can avoid the problems whilst doing its thing, but also benefit from a more declarative style by using Take, Skip, Slice, Head, Tail, Elem etc.